n = int(input())
s = input()
mid = 0
if n % 2 == 0:
mid = n // 2 - 1
else:
mid = n // 2
res = [""] * n
res[mid] = s[0]
count = 1
left = mid - 1
right = mid + 1
if n % 2 == 0:
switch = False
while res.count("") != 0:
if not switch:
switch = True
res[right] = s[count]
right += 1
count += 1
else:
switch = False
res[left] = s[count]
count += 1
left -= 1
else:
switch = False
while res.count("") != 0:
if switch:
switch = False
res[right] = s[count]
right += 1
count += 1
else:
switch = True
res[left] = s[count]
count += 1
left -= 1
print("".join(res))#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main(int argc, char *argv[]) {
int n;
string str, ans = "";
cin >> n >> str;
if(n%2 == 1) {
ans += str[0];
str = str.substr(1, n-1);
}
int state = 0;
while(str.length() > 0) {
if(state == 0) {
ans = str[0] + ans;
state = 1;
} else {
ans = ans + str[0];
state = 0;
}
str = str.substr(1, str.length() - 1);
}
cout << ans;
return 0;
}577A - Multiplication Table | 817C - Really Big Numbers |
1355A - Sequence with Digits | 977B - Two-gram |
993A - Two Squares | 1659D - Reverse Sort Sum |
1659A - Red Versus Blue | 1659B - Bit Flipping |
1480B - The Great Hero | 1519B - The Cake Is a Lie |
1659C - Line Empire | 515A - Drazil and Date |
1084B - Kvass and the Fair Nut | 1101A - Minimum Integer |
985D - Sand Fortress | 1279A - New Year Garland |
1279B - Verse For Santa | 202A - LLPS |
978A - Remove Duplicates | 1304A - Two Rabbits |
225A - Dice Tower | 1660D - Maximum Product Strikes Back |
1513A - Array and Peaks | 1251B - Binary Palindromes |
768B - Code For 1 | 363B - Fence |
991B - Getting an A | 246A - Buggy Sorting |
884A - Book Reading | 1180A - Alex and a Rhombus |